An Exact Algorithm for Bilevel 0-1 Knapsack Problems
نویسندگان
چکیده
منابع مشابه
Solving 0-1 knapsack problems based on amoeboid organism algorithm
The 0-1 knapsack problem is an open issue in discrete optimization problems, which plays an important role in real applications. In this paper, a new bio-inspired model is proposed to solve this problem. The proposed method has three main steps. First, the 0-1 knapsack problem is converted into a directed graph by the network converting algorithm. Then, for the purpose of using the amoeboid org...
متن کاملAn Improved Hybrid Encoding Cuckoo Search Algorithm for 0-1 Knapsack Problems
Cuckoo search (CS) is a new robust swarm intelligence method that is based on the brood parasitism of some cuckoo species. In this paper, an improved hybrid encoding cuckoo search algorithm (ICS) with greedy strategy is put forward for solving 0-1 knapsack problems. First of all, for solving binary optimization problem with ICS, based on the idea of individual hybrid encoding, the cuckoo search...
متن کاملAn Effective Repair Procedure based on Quantum-inspired Evolutionary Algorithm for 0/1 Knapsack Problems
A new repair method based on QEA for 0/1 knapsack problems is proposed. In this approach, the qubit chromosome is used as heuristic knowledge to evaluate each element for the knapsack. The main idea is to delete the knapsack elements in the ascending order of qubit chromosome’s probability value whilst avoid violating the constraints on its capacity. To minimize the influence of initialization,...
متن کاملExact and approximate algorithms for discounted {0-1} knapsack problem
The D iscounted {0-1} K napsack P roblem (D{0-1}KP) is an extension of the classical 0-1 knapsack problem (0-1 KP) that consists of selecting a set of item groups where each group includes three items and at most one of the three items can be selected. The D{0-1}KP is more challenging than the 0-1 KP because four choices of items in an item group diversify the selection of the items. In this pa...
متن کاملZero Knowledge Proofs for Exact Cover and 0-1 Knapsack
Zero Knowledge Proofs (ZKPs) are interactive protocols in which one party, named the prover, can convince the other party, named the verifier, that some assertion is true without revealing anything other than the fact that the assertion being proven is true. The remarkable property of being both convincing and yielding nothing except the assertion is indeed valid makes ZKPs very powerful tools ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Problems in Engineering
سال: 2012
ISSN: 1024-123X,1563-5147
DOI: 10.1155/2012/504713